Diameters of Cayley Graphs

نویسندگان

  • M Kassabov
  • T R Riley
چکیده

We show that for integers k ≥ 2 and n ≥ 3, the diameter of the Cayley graph of SLn(Z/kZ) associated to a standard two-element generating set, is at most a constant times n 2 ln k. This answers a question of A. Lubotzky concerning SLn(Fp) and is unexpected because these Cayley graphs do not form an expander family. Our proof amounts to a quick algorithm for finding short words representing elements of SLn(Z/kZ).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the eigenvalues of normal edge-transitive Cayley graphs

A graph $Gamma$ is said to be vertex-transitive or edge‎- ‎transitive‎ ‎if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$‎, ‎respectively‎. ‎Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$‎. ‎Then, $Gamma$ is said to be normal edge-transitive‎, ‎if $N_{Aut(Gamma)}(G)$ acts transitively on edges‎. ‎In this paper‎, ‎the eigenvalues of normal edge-tra...

متن کامل

Cayley graphs of given degree and diameters 3, 4 and 5

Let Cd,k be the largest number of vertices in a Cayley graph of degree d and diameter k. We show that Cd,3 ≥ 3 16(d − 3) 3 and Cd,5 ≥ 25(d−7 4 ) 5 for any d ≥ 8, and Cd,4 ≥ 32(d−8 5 ) 4 for any d ≥ 10. For sufficiently large d our graphs are the largest known Cayley graphs of degree d and diameters 3, 4 and 5.

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

Computing Wiener and hyper–Wiener indices of unitary Cayley graphs

The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.

متن کامل

Product of normal edge-transitive Cayley graphs

For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.

متن کامل

On the eigenvalues of Cayley graphs on generalized dihedral groups

‎Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$‎. ‎Then the energy of‎ ‎$Gamma$‎, ‎a concept defined in 1978 by Gutman‎, ‎is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$‎. ‎Also‎ ‎the Estrada index of $Gamma$‎, ‎which is defined in 2000 by Ernesto Estrada‎, ‎is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$‎. ‎In this paper‎, ‎we compute the eigen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005